Hyperaccurate Ellipse Fitting without Iterations
نویسندگان
چکیده
This paper presents a new method for fitting an ellipse to a point sequence extracted from images. It is widely known that the best fit is obtained by maximum likelihood. However, it requires iterations, which may not converge in the presence of large noise. Our approach is algebraic distance minimization; no iterations are required. Exploiting the fact that the solution depends on the way the scale is normalized, we analyze the accuracy to high order error terms with the scale normalization weight unspecified and determine it so that the bias is zero up to the second order. We demonstrate by experiments that our method is superior to the Taubin method, also algebraic and known to be highly accurate. Proc. Int. Conf. Computer Vision Theory and Applications (VISAPP 2010), Angers, France, May 2010, Vol. 2, pp. 5–12.
منابع مشابه
Hyperaccurate Correction of Maximum Likelihood for Geometric Estimation
Abstract: The best known method for optimally computing parameters from noisy data based on geometric constraints is maximum likelihood (ML). This paper reinvestigates “hyperaccurate correction” for further improving the accuracy of ML. In the past, only the case of a single scalar constraint was studied. In this paper, we extend it to multiple constraints given in the form of vector equations....
متن کاملEllipse Fitting with Hyperaccuracy
For fitting an ellipse to a point sequence, ML (maximum likelihood) has been regarded as having the highest accuracy. In this paper, we demonstrate the existence of a “hyperaccurate” method which outperforms ML. This is made possible by error analysis of ML followed by subtraction of high-order bias terms. Since ML nearly achieves the theoretical accuracy bound (the KCR lower bound), the result...
متن کاملPerformance Evaluation of Accurate Ellipse Fitting
This paper studies numerical schemes for fitting an ellipse to points in an image. First, the problem is posed as maximum likelihood, and the relationship to the KCR lower bound is stated. Then, the algorithms of FNS, HEIV, renormalization, and Gauss-Newton iterations are described. Using simulated and real image data, their convergence properties are compared, and their dependence on the shape...
متن کاملPerformance evaluation of iterative geometric fitting algorithms
The convergence performance of typical numerical schemes for geometric fitting for computer vision applications is compared. First, the problem and the associated KCR lower bound are stated. Then, three well known fitting algorithms are described: FNS, HEIV, and renormalization. To these, we add a special variant of Gauss-Newton iterations. For initialization of iterations, random choice, least...
متن کاملGeometric Interpretation and Precision Analysis of Algebraic Ellipse Fitting Using Least Squares Method
This paper presents a new approach for precision estimation for algebraic ellipse fitting based on combined least squares method. Our approach is based on coordinate description of the ellipse geometry to determine the error distances of the fitting method. Since it is an effective fitting algorithm the well-known Direct Ellipse Fitting method was selected as an algebraic method for precision e...
متن کامل